-
1 linear-hash file
Вычислительная техника: линейно-хешированный файл -
2 linear-hash file
-
3 линейно-хешированный файл
Information technology: LH file, linear-hash fileУниверсальный русско-английский словарь > линейно-хешированный файл
-
4 search
1) поиск || искать; осуществлять поиск || поисковый3) исследование; изучение || исследовать; изучать•- search in state space
- admissible search
- area search
- automated search
- automatic search
- automatic program search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search - brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci search
- Fibonacci numbers search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word search -
5 search
1) поиск || искать; осуществлять поиск || поисковый2) вчт. команда или программа поиска3) исследование; изучение || исследовать; изучать•- area search
- automated search
- automatic program search
- automatic search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search
- breadth-first search
- Brent's search
- brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci numbers search
- Fibonacci search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- search for extraterrestrial intelligence
- search in problem space
- search in state space
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word searchThe New English-Russian Dictionary of Radio-electronics > search
См. также в других словарях:
Linear hash — Linear Hashing is a dynamic hash table algorithm invented by Witold Litwin (1980) [ Citation | first1=Witold | last1=Litwin | title=Linear hashing: A new tool for file and table addressing | journal=Proc. 6th Conference on Very Large Databases |… … Wikipedia
Hash function — A hash function is any well defined procedure or mathematical function for turning some kind of data into a relatively small integer, that may serve as an index into an array. The values returned by a hash function are called hash values, hash… … Wikipedia
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
BANG file — A BANG file (balanced and nested grid file) is a point access method which divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash. Cells may intersect, and points may be distributed between them. Another meaning … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… … Wikipedia
Pick operating system — Company / developer Don Nelson, Dick Pick, TRW Programmed in Assembly language Initial release 1965 (GIRLS), 1973 (Reality Operating System) Marketing target Business data processing Available … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia